Parameterized Compilability
نویسنده
چکیده
Compilability is a measure of how effectively compilation (or preprocessing) can be applied to knowledge bases specified in a particular knowledge representation formalism; the aim of compilation is to allow for efficient, on-line query processing. A theory of compilability has been established for organizing knowledge representation formalisms according to a scheme of “compilability classes”, and bears strong analogies to the classical theory of complexity, which permits the organization of computational problems according to complexity classes. We develop a novel theory of compilability, called parameterized compilability, which incorporates the notion of parameterization as used in parameterized complexity and permits for refined analysis of compilability.
منابع مشابه
Positive andNegative Results for Parameterized Compilability
Most relevant computational tasks are not polynomial-size compilable, even though they are compiled rather efficiently in practice. Parameterized compilability offers a framework to narrow this gap between theoretical incompilability and practical compilation by relaxing the size bound posed on compilations. We study various computational problems (related to clause entailment, the classical pr...
متن کاملParameter Compilation
In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is relatively expensive. In this article, we introduce a formal framework for classifying problems according to their compilability. The basic object in our fram...
متن کاملPreprocessing of Intractable Problems
Some computationally hard problems –e.g., deduction in logical knowledge bases– are such that part of an instance is known well before the rest of it, and remains the same for several subsequent instances of the problem. In these cases, it is useful to preprocess off-line this known part so as to simplify the remaining on-line problem. In this paper we investigate such a technique in the contex...
متن کاملCompilation of Intractable Problems and Its Application to Artificial Intelligence
Intractable problems are hard to solve. Since the work “has to be done”, various solutions have been developed. The two classical ones are the language restriction and the approximation. The first solution is to admit input strings only if they have a certain form. The second one is to find a solution that can be sometimes incorrect. In this dissertation we concentrate on compilation. The basic...
متن کاملA On the Complexity of Existential Positive Queries
We systematically investigate the complexity of model checking the existential positive fragment of firstorder logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted to fall into the set; a natural question is then to classify which sentence sets are tractable and which are intractable. With respect to fixed-parameter tract...
متن کامل